package bitOperation;

/*
 *@description 只出现一次的数字
 *@author hkfan
 *@version 1.0
 *@create 2025/6/23 17:06
 */
public class LeetCode_136 {
    public int singleNumber(int[] nums) {
        int res =nums[0];
        for (int i = 1 ; i < nums.length; i++) {
            res ^=nums[i];
        }
        return res;

    }
}
